Minimizing Makespan with Multiple Orders per Job in a Two Machine Flowshop with Item Processing
نویسندگان
چکیده
New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders per job scheduling problem in the context of a 2-machine flowshop. A lower bound for the makespan performance measure is provided. An optimization model is presented that addresses both job formation and job sequencing.
منابع مشابه
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, and the increase in wafer size to 300-mm reduces the number of wafers required for a customer order, combining multiple orders into a single job is a necessity for efficient production. We investigate the multiple orders...
متن کاملTwo-machine flowshop scheduling with flexible operations and controllable processing times
TWO-MACHINE FLOWSHOP SCHEDULING WITH FLEXIBLE OPERATIONS AND CONTROLLABLE PROCESSING TIMES Zeynep Uruk M.S. in Industrial Engineering Advisor: Prof. Dr. Selim Aktürk Co-Advisor: Asst. Prof. Dr. Hakan Gültekin August, 2011 In this study, we consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed ...
متن کاملMinimizing Total Weighted Tardiness in a Flexible Flowshop Environment Considering Batch Processing Machines
Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environmen...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملMinimizing makespan in flowshop with time lags
We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags, denoted by Fm|θ, θ|Cmax. Time lag constraints generalize the classical precedence constraints between operations: minimal (respectively maximal) time lags indeed specify that the time elapsed between two operations must be lower(respectively upper-) bounded. We assume that such constraints ...
متن کامل